Communication Over Finite-Chain-Ring Matrix Channels

Quantum codes over a class of finite chain ring

In this study, we introduce a new Gray map which preserves the orthogonality from the chain ring F2 [u] / (u) to F s 2 where F2 is the finite field with two elements. We also give a condition of the existence for cyclic codes of odd length containing its dual over the ring F2 [u] / (u) . By taking advantage of this Gray map and the structure of the ring, we obtain two classes of binary quantum ...

On Skew Cyclic Codes over a Finite Ring

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

Wireless Communication over Dispersive Channels

Video communication over broadcast channels

This paper investigates the problem of communicating video over a broadcast channel. The broadcast channel is expressed in terms of the channel capacity that exists between the transmitter and each receiver in the broadcast area { Shannon's separation theorem does not apply for video communication over this class of channels. Digital (discrete time, discrete amplitude) and hybrid (discrete time...

Feedback Communication over Unknown Channels

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. Is there a coding scheme (possibly with variable transmission time) that can achieve the Burnashev error exponent uniformly over Q ? For two families of channels we show that the answer is yes. Furthermore, for each of these two classes, in add...